Constructions of protocol sequences for multiple access collision channel without feedback

نویسندگان

  • László Györfi
  • István Vajda
چکیده

Constructions of protocol sequences for multiple-access collision channel without feedback are given. These constructions are the extensions of those described by A, GyiiriI, and Massey. If the basic code in their constructions, a Reed-Solomon code, is replaced by a BCH code then the resulting protocol sequences have the feature that, for a given sum rate, the ratio of the total user population to the block length becomes much larger.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Collision Channel with Asynchronous Access

SUMMARY A T user multiple access collision channel without feedback is considered where the channel inputs are called packets. The packets take values from non-binary input alphabet. It is supposed that at most M users are active, i.e., are communicating simultaneously (2 ≤ M T). We are looking for codes and protocol sequences of users of minimum length such that from the output of the channel ...

متن کامل

Bounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel

In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...

متن کامل

User-Irrepressible Sequences

Protocol sequences are binary and periodic sequences used in multiple-access scheme for collision channel without feedback. Each user reads out the bits from the assigned protocol sequence periodically, and sends a packet whenever the bit is equal to one. It is assumed that any two or more packets overlapping in time result in a collision, and the collided packets are unrecoverable. Due to the ...

متن کامل

A Common Information-Based Multiple Access Protocol Achieving Full Throughput and Linear Delay

We consider a multiple access communication system where multiple users share a common collision channel. Each user observes its local traffic and the feedback from the channel. At each time instant the feedback from the channel is one of three messages: no transmission, successful transmission, collision. The objective is to design a transmission protocol that coordinates the users’ transmissi...

متن کامل

Protocol Sequences for Multiple-Packet Reception

We consider the slot-synchronized collision channel without feedback, in which K active users all transmit their packets to one sink. It is assumed that the channel has the ability of the multiple-packet reception (MPR), i.e., can accommodate at most γ (1 ≤ γ < K) simultaneous transmissions. Each user accesses the channel following a specific periodical zero-one pattern, called the protocol seq...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 39  شماره 

صفحات  -

تاریخ انتشار 1993